Fault-Tolerant Routing and Disjoint Paths in Dual-Cube: A New Interconnection Network

In this paper, we introduce a new interconnection network, the dual-cube, its topological properties, and the routing/broadcasting algorithms in the dual-cube. The advanced subjects such as fault-tolerant routing and constructing multiple disjoint paths in dual-cubes are also included in this paper. The binary hypercube, or r-cube, can connect 2r nodes. In contrast, a dual-cube with r links for each node, Fr, can connect 22r−1 nodes while keeps most of topological properties of hypercubes. Fault-tolerant routing and constructing multiple disjoint paths in dual-cubes can be solved elegantly using a new structure, called extended cube. We show that for any two nonfaulty nodes s and t in Fr which contains up to r−1 faulty nodes, we can find a faultfree path s to t, of length at most 3d(s, t) in O(r) optimal time, where d(s, t) is the distance between s and t. We also show that, in a fault-free Fr, r disjoint paths s to t, of length at most d(s, t)+6 can be constructed in O(r2) optimal time. keywords: Interconnection networks, hypercube, broadcasting, routing, fault-tolerance, disjoint paths